Lexicographic ordering: intuitive multicriteria optimization for IMRT
نویسندگان
چکیده
منابع مشابه
Lexicographic ordering: intuitive multicriteria optimization for IMRT.
Optimization problems in IMRT inverse planning are inherently multicriterial since they involve multiple planning goals for targets and their neighbouring critical tissue structures. Clinical decisions are generally required, based on tradeoffs among these goals. Since the tradeoffs cannot be quantitatively determined prior to optimization, the decision-making process is usually indirect and it...
متن کاملLexicographic goal programming approach for portfolio optimization
This paper will investigate the optimum portfolio for an investor, taking into account 5 criteria. The mean variance model of portfolio optimization that was introduced by Markowitz includes two objective functions; these two criteria, risk and return do not encompass all of the information about investment; information like annual dividends, S&P star ranking and return in later years which is ...
متن کاملPropagation algorithms for lexicographic ordering constraints
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constraint programming to a problem, it is modelled by a set of constraints on a set of decision variables. A common modelling pattern is the use of matrices of decision variables. The rows and/or columns of these matrices are ...
متن کاملThe Light Lexicographic path Ordering
We introduce syntactic restrictions of the lexicographic path ordering to obtain the Light Lexicographic Path Ordering. We show that the light lexicographic path ordering leads to a characterisation of the functions computable in space bounded by a polynomial in the size of the inputs.
متن کاملRevisiting the Lexicographic Ordering Constraint
We present a global consistency algorithm for the lexicographic ordering constraint on two vectors of n variables. The algorithm maintains arcconsistency, runs in O(n) time on posting plus amortized O(1) time per propagation event, and detects entailment or rewrites itself to a simpler constraint whenever possible. The algorithm was derived from a finite automaton operating on a string which ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics in Medicine and Biology
سال: 2007
ISSN: 0031-9155,1361-6560
DOI: 10.1088/0031-9155/52/7/006